منابع مشابه
Optional games on cycles and complete graphs.
We study stochastic evolution of optional games on simple graphs. There are two strategies, A and B, whose interaction is described by a general payoff matrix. In addition, there are one or several possibilities to opt out from the game by adopting loner strategies. Optional games lead to relaxed social dilemmas. Here we explore the interaction between spatial structure and optional games. We f...
متن کاملSelmer Group Heuristics and Sieves
In the past decade or so, the most elementary of the sieve methods of analytic number theory has been adapted to a geometric setting. In this geometric setting, the primes are replaced by the closed points of a variety over a finite field or more generally of a scheme of finite type over Z. We will present the method and some of the results that have been proved using it. For instance, the prob...
متن کاملOn participation games with complete information
We analyze a class of two-candidate voter participation games under complete information that encompasses as special cases certain public good provision games. We characterize the Nash equilibria of these games as stationary points of a non-linear programming problem, the objective function of which is a Morse function (one that does not admit degenerate critical points) for almost all costs of...
متن کاملPSPACE-Complete Two-Color Placement Games
We show that three placement games, Col, NoGo, and Fjords, are PSPACE-complete on planar graphs. The hardness of Col and Fjords is shown via a reduction from Bounded 2-Player Constraint Logicand NoGo is shown to be hard directly from Col. 1 Background 1.1 Combinatorial Game Theory Combinatorial Game Theory is the study of games with: • Two players alternating turns, • No randomness, and • Perfe...
متن کاملDValue for Boolean games is EXP-complete
We show that the following problem is EXP-complete: given a rational v and a two player, zero-sum Boolean gameG determine whether the value of G is at least v. The proof is via a translation of the proof of the same result for Boolean circuit games in [1]. 1 Preliminaries We will be using the encoding of [2] to replicate the proof of [1]. A familiarity with [2] will make the proof much easier t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1988
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1988-0929013-2